MAYBE 3.783
H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could not be shown:
↳ HASKELL
↳ BR
mainModule Main
| ((enumFromThen :: () -> () -> [()]) :: () -> () -> [()]) |
module Main where
Replaced joker patterns by fresh variables and removed binding patterns.
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
mainModule Main
| ((enumFromThen :: () -> () -> [()]) :: () -> () -> [()]) |
module Main where
Cond Reductions:
The following Function with conditions
is transformed to
undefined0 | True | = undefined |
undefined1 | | = undefined0 False |
The following Function with conditions
is transformed to
toEnum1 | vz | = toEnum0 (vz == 0) vz |
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
mainModule Main
| ((enumFromThen :: () -> () -> [()]) :: () -> () -> [()]) |
module Main where
Num Reduction: All numbers are transformed to thier corresponding representation with Pos, Neg, Succ and Zero.
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ Narrow
mainModule Main
| (enumFromThen :: () -> () -> [()]) |
module Main where
Haskell To QDPs
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ Narrow
Q DP problem:
The TRS P consists of the following rules:
new_primMinusNat(Succ(wu2100), Succ(wu23000)) → new_primMinusNat(wu2100, wu23000)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_primMinusNat(Succ(wu2100), Succ(wu23000)) → new_primMinusNat(wu2100, wu23000)
The graph contains the following edges 1 > 1, 2 > 2
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ Narrow
Q DP problem:
The TRS P consists of the following rules:
new_primPlusNat(Succ(wu2100), Succ(wu22000)) → new_primPlusNat(wu2100, wu22000)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_primPlusNat(Succ(wu2100), Succ(wu22000)) → new_primPlusNat(wu2100, wu22000)
The graph contains the following edges 1 > 1, 2 > 2
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ Narrow
Q DP problem:
The TRS P consists of the following rules:
new_primPlusInt(Succ(wu210), Succ(wu2200), wu23) → new_primPlusInt(wu210, wu2200, wu23)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_primPlusInt(Succ(wu210), Succ(wu2200), wu23) → new_primPlusInt(wu210, wu2200, wu23)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 3
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ Rewriting
↳ Narrow
Q DP problem:
The TRS P consists of the following rules:
new_map(wu6, wu7, wu8, ba, bb, bc) → new_map(wu6, wu7, new_ps(wu6, wu7, wu8, bb, bc), ba, bb, bc)
The TRS R consists of the following rules:
new_fromEnum6(wu15, ty_Char) → new_fromEnum7(wu15)
new_primPlusInt0(Zero, Neg(Zero), Neg(wu230)) → new_primMinusNat1(wu230)
new_fromEnum6(wu15, ty_Double) → new_fromEnum4(wu15)
new_fromEnum6(wu15, app(ty_Ratio, bf)) → new_fromEnum(wu15, bf)
new_primPlusNat2(wu210, Succ(wu2300)) → Succ(Succ(new_primPlusNat1(wu210, wu2300)))
new_primPlusInt1(Succ(wu210), Zero, Pos(wu230)) → Pos(new_primPlusNat2(wu210, wu230))
new_primPlusNat2(wu210, Zero) → Succ(wu210)
new_primPlusNat0(Succ(wu210), Zero, wu230) → new_primPlusNat2(wu210, wu230)
new_primPlusNat0(Zero, Succ(wu2200), wu230) → new_primPlusNat2(wu2200, wu230)
new_primPlusInt1(Zero, Zero, Pos(wu230)) → Pos(new_primPlusNat3(wu230))
new_fromEnum5(wu15, ty_Bool) → new_fromEnum3(wu15)
new_primPlusInt3(Pos(wu140), wu15, wu16, be) → new_primPlusInt0(wu140, new_fromEnum5(wu15, be), wu16)
new_primMinusNat2(Succ(wu2300), wu2200) → new_primMinusNat3(wu2300, wu2200)
new_fromEnum10(wu6, ty_Float) → new_fromEnum0(wu6)
new_primPlusInt1(Zero, Zero, Neg(wu230)) → new_primMinusNat1(wu230)
new_primPlusNat1(Succ(wu2100), Succ(wu22000)) → Succ(Succ(new_primPlusNat1(wu2100, wu22000)))
new_primMinusNat0(wu210, Zero) → Pos(Succ(wu210))
new_primPlusInt2(Succ(wu280), Pos(Zero), Pos(Zero)) → new_primMinusNat2(Zero, wu280)
new_primPlusInt2(Succ(wu280), Pos(Zero), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), wu280)
new_fromEnum10(wu6, ty_Int) → new_fromEnum8(wu6)
new_fromEnum10(wu6, ty_Double) → new_fromEnum4(wu6)
new_fromEnum6(wu15, ty_Integer) → new_fromEnum1(wu15)
new_primMinusNat2(Zero, wu2200) → Neg(Succ(wu2200))
new_fromEnum8(wu6) → error([])
new_fromEnum2(@0) → Pos(Zero)
new_primPlusInt1(Succ(wu210), Zero, Neg(wu230)) → new_primMinusNat0(wu210, wu230)
new_fromEnum10(wu6, ty_Integer) → new_fromEnum1(wu6)
new_fromEnum10(wu6, ty_@0) → new_fromEnum2(wu6)
new_primPlusNat1(Zero, Zero) → Zero
new_fromEnum6(wu15, ty_Float) → new_fromEnum0(wu15)
new_primPlusInt1(Zero, Succ(wu2200), Pos(wu230)) → new_primMinusNat2(wu230, wu2200)
new_fromEnum5(wu15, ty_Int) → new_fromEnum8(wu15)
new_primMinusNat3(Zero, Succ(wu23000)) → Neg(Succ(wu23000))
new_fromEnum6(wu15, ty_@0) → new_fromEnum2(wu15)
new_primPlusInt0(Succ(wu210), Neg(Succ(wu2200)), Neg(wu230)) → new_primMinusNat0(Succ(new_primPlusNat1(wu210, wu2200)), wu230)
new_primPlusInt0(Zero, Neg(Succ(wu2200)), Neg(wu230)) → new_primMinusNat0(wu2200, wu230)
new_primPlusNat3(Zero) → Zero
new_fromEnum3(wu6) → error([])
new_fromEnum5(wu15, ty_Float) → new_fromEnum0(wu15)
new_primPlusInt1(Zero, Succ(wu2200), Neg(wu230)) → Neg(new_primPlusNat2(wu2200, wu230))
new_fromEnum5(wu15, ty_Ordering) → new_fromEnum9(wu15)
new_primPlusInt0(Succ(wu210), Neg(Zero), Neg(wu230)) → new_primMinusNat0(wu210, wu230)
new_fromEnum5(wu15, ty_Double) → new_fromEnum4(wu15)
new_primPlusInt0(wu21, Neg(wu220), Pos(wu230)) → Pos(new_primPlusNat0(wu21, wu220, wu230))
new_primPlusInt2(Zero, Pos(Succ(wu2900)), Pos(Zero)) → new_primMinusNat2(Zero, wu2900)
new_fromEnum(wu6, bd) → error([])
new_primMinusNat0(wu210, Succ(wu2300)) → new_primMinusNat3(wu210, wu2300)
new_primPlusInt2(Zero, Pos(Zero), Pos(Succ(wu3000))) → new_primMinusNat0(wu3000, Zero)
new_fromEnum10(wu6, ty_Bool) → new_fromEnum3(wu6)
new_fromEnum0(wu6) → error([])
new_fromEnum10(wu6, ty_Ordering) → new_fromEnum9(wu6)
new_primMinusNat3(Succ(wu2100), Zero) → Pos(Succ(wu2100))
new_primPlusNat3(Succ(wu2300)) → Succ(wu2300)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt3(Neg(wu140), wu15, wu16, be) → new_primPlusInt2(wu140, new_fromEnum6(wu15, be), wu16)
new_primPlusInt2(wu28, Pos(wu290), Neg(wu300)) → Neg(new_primPlusNat0(wu28, wu290, wu300))
new_primPlusInt0(wu21, Pos(wu220), wu23) → new_primPlusInt1(wu21, wu220, wu23)
new_fromEnum5(wu15, ty_Integer) → new_fromEnum1(wu15)
new_primPlusInt2(Succ(wu280), Pos(Succ(wu2900)), Pos(Zero)) → new_primMinusNat2(Zero, Succ(new_primPlusNat1(wu280, wu2900)))
new_fromEnum4(wu6) → error([])
new_primMinusNat3(Zero, Zero) → Pos(Zero)
new_fromEnum9(wu6) → error([])
new_fromEnum6(wu15, ty_Int) → new_fromEnum8(wu15)
new_fromEnum1(wu6) → error([])
new_primPlusInt2(Zero, Pos(Succ(wu2900)), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), wu2900)
new_primPlusInt2(wu28, Neg(wu290), wu30) → new_primPlusInt1(wu290, wu28, wu30)
new_fromEnum10(wu6, app(ty_Ratio, bd)) → new_fromEnum(wu6, bd)
new_primPlusNat1(Succ(wu2100), Zero) → Succ(wu2100)
new_primPlusNat1(Zero, Succ(wu22000)) → Succ(wu22000)
new_fromEnum7(wu6) → error([])
new_primMinusNat1(Succ(wu2300)) → Neg(Succ(wu2300))
new_primPlusInt2(Zero, Pos(Zero), Pos(Zero)) → new_primMinusNat1(Zero)
new_fromEnum6(wu15, ty_Bool) → new_fromEnum3(wu15)
new_primMinusNat3(Succ(wu2100), Succ(wu23000)) → new_primMinusNat3(wu2100, wu23000)
new_fromEnum5(wu15, ty_@0) → new_fromEnum2(wu15)
new_ps(wu6, wu7, wu8, bb, bc) → new_primPlusInt3(new_fromEnum10(wu6, bb), wu7, wu8, bc)
new_primPlusInt2(Succ(wu280), Pos(Succ(wu2900)), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), Succ(new_primPlusNat1(wu280, wu2900)))
new_fromEnum10(wu6, ty_Char) → new_fromEnum7(wu6)
new_primPlusNat0(Succ(wu210), Succ(wu2200), wu230) → new_primPlusNat2(Succ(new_primPlusNat1(wu210, wu2200)), wu230)
new_fromEnum6(wu15, ty_Ordering) → new_fromEnum9(wu15)
new_fromEnum5(wu15, ty_Char) → new_fromEnum7(wu15)
new_primPlusNat0(Zero, Zero, wu230) → new_primPlusNat3(wu230)
new_primPlusInt1(Succ(wu210), Succ(wu2200), wu23) → new_primPlusInt1(wu210, wu2200, wu23)
new_fromEnum5(wu15, app(ty_Ratio, bf)) → new_fromEnum(wu15, bf)
The set Q consists of the following terms:
new_fromEnum6(x0, ty_Ordering)
new_fromEnum8(x0)
new_primMinusNat2(Succ(x0), x1)
new_fromEnum7(x0)
new_primPlusInt0(Succ(x0), Neg(Succ(x1)), Neg(x2))
new_primPlusInt2(Succ(x0), Pos(Zero), Pos(Zero))
new_fromEnum5(x0, ty_Double)
new_primPlusInt1(Succ(x0), Succ(x1), x2)
new_fromEnum5(x0, ty_Ordering)
new_primPlusNat3(Succ(x0))
new_fromEnum6(x0, ty_@0)
new_ps(x0, x1, x2, x3, x4)
new_fromEnum10(x0, ty_Char)
new_fromEnum9(x0)
new_primPlusInt0(Zero, Neg(Succ(x0)), Neg(x1))
new_primPlusInt0(Zero, Neg(Zero), Neg(x0))
new_fromEnum5(x0, ty_Int)
new_primPlusNat1(Zero, Succ(x0))
new_fromEnum10(x0, ty_@0)
new_primPlusNat1(Succ(x0), Succ(x1))
new_primPlusNat2(x0, Zero)
new_primPlusInt1(Succ(x0), Zero, Neg(x1))
new_fromEnum(x0, x1)
new_fromEnum10(x0, ty_Integer)
new_primPlusInt2(Zero, Pos(Succ(x0)), Pos(Zero))
new_primPlusInt1(Zero, Zero, Neg(x0))
new_primPlusNat1(Succ(x0), Zero)
new_primPlusInt2(x0, Neg(x1), x2)
new_primPlusInt0(x0, Pos(x1), x2)
new_fromEnum3(x0)
new_fromEnum6(x0, app(ty_Ratio, x1))
new_primPlusInt2(Succ(x0), Pos(Zero), Pos(Succ(x1)))
new_fromEnum5(x0, ty_@0)
new_primPlusNat0(Succ(x0), Succ(x1), x2)
new_primPlusInt0(Succ(x0), Neg(Zero), Neg(x1))
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Zero, Zero)
new_primPlusNat0(Zero, Zero, x0)
new_fromEnum4(x0)
new_fromEnum6(x0, ty_Bool)
new_fromEnum6(x0, ty_Float)
new_primPlusInt2(Succ(x0), Pos(Succ(x1)), Pos(Zero))
new_fromEnum10(x0, ty_Double)
new_primPlusInt1(Zero, Succ(x0), Neg(x1))
new_primMinusNat3(Zero, Zero)
new_fromEnum5(x0, ty_Integer)
new_fromEnum6(x0, ty_Integer)
new_primPlusInt2(Zero, Pos(Zero), Pos(Succ(x0)))
new_fromEnum1(x0)
new_primPlusInt1(Zero, Zero, Pos(x0))
new_fromEnum10(x0, ty_Int)
new_fromEnum5(x0, ty_Char)
new_primPlusInt2(Succ(x0), Pos(Succ(x1)), Pos(Succ(x2)))
new_fromEnum6(x0, ty_Double)
new_primMinusNat3(Zero, Succ(x0))
new_primMinusNat1(Zero)
new_primPlusInt0(x0, Neg(x1), Pos(x2))
new_primMinusNat3(Succ(x0), Succ(x1))
new_fromEnum5(x0, app(ty_Ratio, x1))
new_fromEnum2(@0)
new_primPlusInt2(x0, Pos(x1), Neg(x2))
new_fromEnum10(x0, ty_Float)
new_fromEnum0(x0)
new_primMinusNat0(x0, Zero)
new_primPlusNat3(Zero)
new_primMinusNat2(Zero, x0)
new_primPlusNat0(Zero, Succ(x0), x1)
new_fromEnum5(x0, ty_Float)
new_fromEnum10(x0, ty_Ordering)
new_primPlusInt1(Succ(x0), Zero, Pos(x1))
new_primPlusInt1(Zero, Succ(x0), Pos(x1))
new_primMinusNat3(Succ(x0), Zero)
new_primPlusNat2(x0, Succ(x1))
new_primPlusInt2(Zero, Pos(Zero), Pos(Zero))
new_fromEnum10(x0, app(ty_Ratio, x1))
new_primPlusInt3(Pos(x0), x1, x2, x3)
new_fromEnum6(x0, ty_Char)
new_primPlusInt2(Zero, Pos(Succ(x0)), Pos(Succ(x1)))
new_primPlusNat0(Succ(x0), Zero, x1)
new_primMinusNat0(x0, Succ(x1))
new_primPlusInt3(Neg(x0), x1, x2, x3)
new_fromEnum6(x0, ty_Int)
new_fromEnum5(x0, ty_Bool)
new_fromEnum10(x0, ty_Bool)
We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map(wu6, wu7, wu8, ba, bb, bc) → new_map(wu6, wu7, new_ps(wu6, wu7, wu8, bb, bc), ba, bb, bc) at position [2] we obtained the following new rules:
new_map(wu6, wu7, wu8, ba, bb, bc) → new_map(wu6, wu7, new_primPlusInt3(new_fromEnum10(wu6, bb), wu7, wu8, bc), ba, bb, bc)
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ Narrow
Q DP problem:
The TRS P consists of the following rules:
new_map(wu6, wu7, wu8, ba, bb, bc) → new_map(wu6, wu7, new_primPlusInt3(new_fromEnum10(wu6, bb), wu7, wu8, bc), ba, bb, bc)
The TRS R consists of the following rules:
new_fromEnum6(wu15, ty_Char) → new_fromEnum7(wu15)
new_primPlusInt0(Zero, Neg(Zero), Neg(wu230)) → new_primMinusNat1(wu230)
new_fromEnum6(wu15, ty_Double) → new_fromEnum4(wu15)
new_fromEnum6(wu15, app(ty_Ratio, bf)) → new_fromEnum(wu15, bf)
new_primPlusNat2(wu210, Succ(wu2300)) → Succ(Succ(new_primPlusNat1(wu210, wu2300)))
new_primPlusInt1(Succ(wu210), Zero, Pos(wu230)) → Pos(new_primPlusNat2(wu210, wu230))
new_primPlusNat2(wu210, Zero) → Succ(wu210)
new_primPlusNat0(Succ(wu210), Zero, wu230) → new_primPlusNat2(wu210, wu230)
new_primPlusNat0(Zero, Succ(wu2200), wu230) → new_primPlusNat2(wu2200, wu230)
new_primPlusInt1(Zero, Zero, Pos(wu230)) → Pos(new_primPlusNat3(wu230))
new_fromEnum5(wu15, ty_Bool) → new_fromEnum3(wu15)
new_primPlusInt3(Pos(wu140), wu15, wu16, be) → new_primPlusInt0(wu140, new_fromEnum5(wu15, be), wu16)
new_primMinusNat2(Succ(wu2300), wu2200) → new_primMinusNat3(wu2300, wu2200)
new_fromEnum10(wu6, ty_Float) → new_fromEnum0(wu6)
new_primPlusInt1(Zero, Zero, Neg(wu230)) → new_primMinusNat1(wu230)
new_primPlusNat1(Succ(wu2100), Succ(wu22000)) → Succ(Succ(new_primPlusNat1(wu2100, wu22000)))
new_primMinusNat0(wu210, Zero) → Pos(Succ(wu210))
new_primPlusInt2(Succ(wu280), Pos(Zero), Pos(Zero)) → new_primMinusNat2(Zero, wu280)
new_primPlusInt2(Succ(wu280), Pos(Zero), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), wu280)
new_fromEnum10(wu6, ty_Int) → new_fromEnum8(wu6)
new_fromEnum10(wu6, ty_Double) → new_fromEnum4(wu6)
new_fromEnum6(wu15, ty_Integer) → new_fromEnum1(wu15)
new_primMinusNat2(Zero, wu2200) → Neg(Succ(wu2200))
new_fromEnum8(wu6) → error([])
new_fromEnum2(@0) → Pos(Zero)
new_primPlusInt1(Succ(wu210), Zero, Neg(wu230)) → new_primMinusNat0(wu210, wu230)
new_fromEnum10(wu6, ty_Integer) → new_fromEnum1(wu6)
new_fromEnum10(wu6, ty_@0) → new_fromEnum2(wu6)
new_primPlusNat1(Zero, Zero) → Zero
new_fromEnum6(wu15, ty_Float) → new_fromEnum0(wu15)
new_primPlusInt1(Zero, Succ(wu2200), Pos(wu230)) → new_primMinusNat2(wu230, wu2200)
new_fromEnum5(wu15, ty_Int) → new_fromEnum8(wu15)
new_primMinusNat3(Zero, Succ(wu23000)) → Neg(Succ(wu23000))
new_fromEnum6(wu15, ty_@0) → new_fromEnum2(wu15)
new_primPlusInt0(Succ(wu210), Neg(Succ(wu2200)), Neg(wu230)) → new_primMinusNat0(Succ(new_primPlusNat1(wu210, wu2200)), wu230)
new_primPlusInt0(Zero, Neg(Succ(wu2200)), Neg(wu230)) → new_primMinusNat0(wu2200, wu230)
new_primPlusNat3(Zero) → Zero
new_fromEnum3(wu6) → error([])
new_fromEnum5(wu15, ty_Float) → new_fromEnum0(wu15)
new_primPlusInt1(Zero, Succ(wu2200), Neg(wu230)) → Neg(new_primPlusNat2(wu2200, wu230))
new_fromEnum5(wu15, ty_Ordering) → new_fromEnum9(wu15)
new_primPlusInt0(Succ(wu210), Neg(Zero), Neg(wu230)) → new_primMinusNat0(wu210, wu230)
new_fromEnum5(wu15, ty_Double) → new_fromEnum4(wu15)
new_primPlusInt0(wu21, Neg(wu220), Pos(wu230)) → Pos(new_primPlusNat0(wu21, wu220, wu230))
new_primPlusInt2(Zero, Pos(Succ(wu2900)), Pos(Zero)) → new_primMinusNat2(Zero, wu2900)
new_fromEnum(wu6, bd) → error([])
new_primMinusNat0(wu210, Succ(wu2300)) → new_primMinusNat3(wu210, wu2300)
new_primPlusInt2(Zero, Pos(Zero), Pos(Succ(wu3000))) → new_primMinusNat0(wu3000, Zero)
new_fromEnum10(wu6, ty_Bool) → new_fromEnum3(wu6)
new_fromEnum0(wu6) → error([])
new_fromEnum10(wu6, ty_Ordering) → new_fromEnum9(wu6)
new_primMinusNat3(Succ(wu2100), Zero) → Pos(Succ(wu2100))
new_primPlusNat3(Succ(wu2300)) → Succ(wu2300)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt3(Neg(wu140), wu15, wu16, be) → new_primPlusInt2(wu140, new_fromEnum6(wu15, be), wu16)
new_primPlusInt2(wu28, Pos(wu290), Neg(wu300)) → Neg(new_primPlusNat0(wu28, wu290, wu300))
new_primPlusInt0(wu21, Pos(wu220), wu23) → new_primPlusInt1(wu21, wu220, wu23)
new_fromEnum5(wu15, ty_Integer) → new_fromEnum1(wu15)
new_primPlusInt2(Succ(wu280), Pos(Succ(wu2900)), Pos(Zero)) → new_primMinusNat2(Zero, Succ(new_primPlusNat1(wu280, wu2900)))
new_fromEnum4(wu6) → error([])
new_primMinusNat3(Zero, Zero) → Pos(Zero)
new_fromEnum9(wu6) → error([])
new_fromEnum6(wu15, ty_Int) → new_fromEnum8(wu15)
new_fromEnum1(wu6) → error([])
new_primPlusInt2(Zero, Pos(Succ(wu2900)), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), wu2900)
new_primPlusInt2(wu28, Neg(wu290), wu30) → new_primPlusInt1(wu290, wu28, wu30)
new_fromEnum10(wu6, app(ty_Ratio, bd)) → new_fromEnum(wu6, bd)
new_primPlusNat1(Succ(wu2100), Zero) → Succ(wu2100)
new_primPlusNat1(Zero, Succ(wu22000)) → Succ(wu22000)
new_fromEnum7(wu6) → error([])
new_primMinusNat1(Succ(wu2300)) → Neg(Succ(wu2300))
new_primPlusInt2(Zero, Pos(Zero), Pos(Zero)) → new_primMinusNat1(Zero)
new_fromEnum6(wu15, ty_Bool) → new_fromEnum3(wu15)
new_primMinusNat3(Succ(wu2100), Succ(wu23000)) → new_primMinusNat3(wu2100, wu23000)
new_fromEnum5(wu15, ty_@0) → new_fromEnum2(wu15)
new_ps(wu6, wu7, wu8, bb, bc) → new_primPlusInt3(new_fromEnum10(wu6, bb), wu7, wu8, bc)
new_primPlusInt2(Succ(wu280), Pos(Succ(wu2900)), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), Succ(new_primPlusNat1(wu280, wu2900)))
new_fromEnum10(wu6, ty_Char) → new_fromEnum7(wu6)
new_primPlusNat0(Succ(wu210), Succ(wu2200), wu230) → new_primPlusNat2(Succ(new_primPlusNat1(wu210, wu2200)), wu230)
new_fromEnum6(wu15, ty_Ordering) → new_fromEnum9(wu15)
new_fromEnum5(wu15, ty_Char) → new_fromEnum7(wu15)
new_primPlusNat0(Zero, Zero, wu230) → new_primPlusNat3(wu230)
new_primPlusInt1(Succ(wu210), Succ(wu2200), wu23) → new_primPlusInt1(wu210, wu2200, wu23)
new_fromEnum5(wu15, app(ty_Ratio, bf)) → new_fromEnum(wu15, bf)
The set Q consists of the following terms:
new_fromEnum6(x0, ty_Ordering)
new_fromEnum8(x0)
new_primMinusNat2(Succ(x0), x1)
new_fromEnum7(x0)
new_primPlusInt0(Succ(x0), Neg(Succ(x1)), Neg(x2))
new_primPlusInt2(Succ(x0), Pos(Zero), Pos(Zero))
new_fromEnum5(x0, ty_Double)
new_primPlusInt1(Succ(x0), Succ(x1), x2)
new_fromEnum5(x0, ty_Ordering)
new_primPlusNat3(Succ(x0))
new_fromEnum6(x0, ty_@0)
new_ps(x0, x1, x2, x3, x4)
new_fromEnum10(x0, ty_Char)
new_fromEnum9(x0)
new_primPlusInt0(Zero, Neg(Succ(x0)), Neg(x1))
new_primPlusInt0(Zero, Neg(Zero), Neg(x0))
new_fromEnum5(x0, ty_Int)
new_primPlusNat1(Zero, Succ(x0))
new_fromEnum10(x0, ty_@0)
new_primPlusNat1(Succ(x0), Succ(x1))
new_primPlusNat2(x0, Zero)
new_primPlusInt1(Succ(x0), Zero, Neg(x1))
new_fromEnum(x0, x1)
new_fromEnum10(x0, ty_Integer)
new_primPlusInt2(Zero, Pos(Succ(x0)), Pos(Zero))
new_primPlusInt1(Zero, Zero, Neg(x0))
new_primPlusNat1(Succ(x0), Zero)
new_primPlusInt2(x0, Neg(x1), x2)
new_primPlusInt0(x0, Pos(x1), x2)
new_fromEnum3(x0)
new_fromEnum6(x0, app(ty_Ratio, x1))
new_primPlusInt2(Succ(x0), Pos(Zero), Pos(Succ(x1)))
new_fromEnum5(x0, ty_@0)
new_primPlusNat0(Succ(x0), Succ(x1), x2)
new_primPlusInt0(Succ(x0), Neg(Zero), Neg(x1))
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Zero, Zero)
new_primPlusNat0(Zero, Zero, x0)
new_fromEnum4(x0)
new_fromEnum6(x0, ty_Bool)
new_fromEnum6(x0, ty_Float)
new_primPlusInt2(Succ(x0), Pos(Succ(x1)), Pos(Zero))
new_fromEnum10(x0, ty_Double)
new_primPlusInt1(Zero, Succ(x0), Neg(x1))
new_primMinusNat3(Zero, Zero)
new_fromEnum5(x0, ty_Integer)
new_fromEnum6(x0, ty_Integer)
new_primPlusInt2(Zero, Pos(Zero), Pos(Succ(x0)))
new_fromEnum1(x0)
new_primPlusInt1(Zero, Zero, Pos(x0))
new_fromEnum10(x0, ty_Int)
new_fromEnum5(x0, ty_Char)
new_primPlusInt2(Succ(x0), Pos(Succ(x1)), Pos(Succ(x2)))
new_fromEnum6(x0, ty_Double)
new_primMinusNat3(Zero, Succ(x0))
new_primMinusNat1(Zero)
new_primPlusInt0(x0, Neg(x1), Pos(x2))
new_primMinusNat3(Succ(x0), Succ(x1))
new_fromEnum5(x0, app(ty_Ratio, x1))
new_fromEnum2(@0)
new_primPlusInt2(x0, Pos(x1), Neg(x2))
new_fromEnum10(x0, ty_Float)
new_fromEnum0(x0)
new_primMinusNat0(x0, Zero)
new_primPlusNat3(Zero)
new_primMinusNat2(Zero, x0)
new_primPlusNat0(Zero, Succ(x0), x1)
new_fromEnum5(x0, ty_Float)
new_fromEnum10(x0, ty_Ordering)
new_primPlusInt1(Succ(x0), Zero, Pos(x1))
new_primPlusInt1(Zero, Succ(x0), Pos(x1))
new_primMinusNat3(Succ(x0), Zero)
new_primPlusNat2(x0, Succ(x1))
new_primPlusInt2(Zero, Pos(Zero), Pos(Zero))
new_fromEnum10(x0, app(ty_Ratio, x1))
new_primPlusInt3(Pos(x0), x1, x2, x3)
new_fromEnum6(x0, ty_Char)
new_primPlusInt2(Zero, Pos(Succ(x0)), Pos(Succ(x1)))
new_primPlusNat0(Succ(x0), Zero, x1)
new_primMinusNat0(x0, Succ(x1))
new_primPlusInt3(Neg(x0), x1, x2, x3)
new_fromEnum6(x0, ty_Int)
new_fromEnum5(x0, ty_Bool)
new_fromEnum10(x0, ty_Bool)
We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ Narrow
Q DP problem:
The TRS P consists of the following rules:
new_map(wu6, wu7, wu8, ba, bb, bc) → new_map(wu6, wu7, new_primPlusInt3(new_fromEnum10(wu6, bb), wu7, wu8, bc), ba, bb, bc)
The TRS R consists of the following rules:
new_fromEnum10(wu6, ty_Float) → new_fromEnum0(wu6)
new_fromEnum10(wu6, ty_Int) → new_fromEnum8(wu6)
new_fromEnum10(wu6, ty_Double) → new_fromEnum4(wu6)
new_fromEnum10(wu6, ty_Integer) → new_fromEnum1(wu6)
new_fromEnum10(wu6, ty_@0) → new_fromEnum2(wu6)
new_fromEnum10(wu6, ty_Bool) → new_fromEnum3(wu6)
new_fromEnum10(wu6, ty_Ordering) → new_fromEnum9(wu6)
new_fromEnum10(wu6, app(ty_Ratio, bd)) → new_fromEnum(wu6, bd)
new_fromEnum10(wu6, ty_Char) → new_fromEnum7(wu6)
new_primPlusInt3(Pos(wu140), wu15, wu16, be) → new_primPlusInt0(wu140, new_fromEnum5(wu15, be), wu16)
new_primPlusInt3(Neg(wu140), wu15, wu16, be) → new_primPlusInt2(wu140, new_fromEnum6(wu15, be), wu16)
new_fromEnum6(wu15, ty_Char) → new_fromEnum7(wu15)
new_fromEnum6(wu15, ty_Double) → new_fromEnum4(wu15)
new_fromEnum6(wu15, app(ty_Ratio, bf)) → new_fromEnum(wu15, bf)
new_fromEnum6(wu15, ty_Integer) → new_fromEnum1(wu15)
new_fromEnum6(wu15, ty_Float) → new_fromEnum0(wu15)
new_fromEnum6(wu15, ty_@0) → new_fromEnum2(wu15)
new_fromEnum6(wu15, ty_Int) → new_fromEnum8(wu15)
new_fromEnum6(wu15, ty_Bool) → new_fromEnum3(wu15)
new_fromEnum6(wu15, ty_Ordering) → new_fromEnum9(wu15)
new_primPlusInt2(Succ(wu280), Pos(Zero), Pos(Zero)) → new_primMinusNat2(Zero, wu280)
new_primPlusInt2(Succ(wu280), Pos(Zero), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), wu280)
new_primPlusInt2(Zero, Pos(Succ(wu2900)), Pos(Zero)) → new_primMinusNat2(Zero, wu2900)
new_primPlusInt2(Zero, Pos(Zero), Pos(Succ(wu3000))) → new_primMinusNat0(wu3000, Zero)
new_primPlusInt2(wu28, Pos(wu290), Neg(wu300)) → Neg(new_primPlusNat0(wu28, wu290, wu300))
new_primPlusInt2(Succ(wu280), Pos(Succ(wu2900)), Pos(Zero)) → new_primMinusNat2(Zero, Succ(new_primPlusNat1(wu280, wu2900)))
new_primPlusInt2(Zero, Pos(Succ(wu2900)), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), wu2900)
new_primPlusInt2(wu28, Neg(wu290), wu30) → new_primPlusInt1(wu290, wu28, wu30)
new_primPlusInt2(Zero, Pos(Zero), Pos(Zero)) → new_primMinusNat1(Zero)
new_primPlusInt2(Succ(wu280), Pos(Succ(wu2900)), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), Succ(new_primPlusNat1(wu280, wu2900)))
new_primPlusNat1(Succ(wu2100), Succ(wu22000)) → Succ(Succ(new_primPlusNat1(wu2100, wu22000)))
new_primPlusNat1(Zero, Zero) → Zero
new_primPlusNat1(Succ(wu2100), Zero) → Succ(wu2100)
new_primPlusNat1(Zero, Succ(wu22000)) → Succ(wu22000)
new_primMinusNat2(Succ(wu2300), wu2200) → new_primMinusNat3(wu2300, wu2200)
new_primMinusNat3(Zero, Succ(wu23000)) → Neg(Succ(wu23000))
new_primMinusNat3(Succ(wu2100), Zero) → Pos(Succ(wu2100))
new_primMinusNat3(Zero, Zero) → Pos(Zero)
new_primMinusNat3(Succ(wu2100), Succ(wu23000)) → new_primMinusNat3(wu2100, wu23000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt1(Succ(wu210), Zero, Pos(wu230)) → Pos(new_primPlusNat2(wu210, wu230))
new_primPlusInt1(Zero, Zero, Pos(wu230)) → Pos(new_primPlusNat3(wu230))
new_primPlusInt1(Zero, Zero, Neg(wu230)) → new_primMinusNat1(wu230)
new_primPlusInt1(Succ(wu210), Zero, Neg(wu230)) → new_primMinusNat0(wu210, wu230)
new_primPlusInt1(Zero, Succ(wu2200), Pos(wu230)) → new_primMinusNat2(wu230, wu2200)
new_primPlusInt1(Zero, Succ(wu2200), Neg(wu230)) → Neg(new_primPlusNat2(wu2200, wu230))
new_primPlusInt1(Succ(wu210), Succ(wu2200), wu23) → new_primPlusInt1(wu210, wu2200, wu23)
new_primPlusNat2(wu210, Succ(wu2300)) → Succ(Succ(new_primPlusNat1(wu210, wu2300)))
new_primPlusNat2(wu210, Zero) → Succ(wu210)
new_primMinusNat2(Zero, wu2200) → Neg(Succ(wu2200))
new_primMinusNat0(wu210, Zero) → Pos(Succ(wu210))
new_primMinusNat0(wu210, Succ(wu2300)) → new_primMinusNat3(wu210, wu2300)
new_primMinusNat1(Succ(wu2300)) → Neg(Succ(wu2300))
new_primPlusNat3(Zero) → Zero
new_primPlusNat3(Succ(wu2300)) → Succ(wu2300)
new_primPlusNat0(Succ(wu210), Zero, wu230) → new_primPlusNat2(wu210, wu230)
new_primPlusNat0(Zero, Succ(wu2200), wu230) → new_primPlusNat2(wu2200, wu230)
new_primPlusNat0(Succ(wu210), Succ(wu2200), wu230) → new_primPlusNat2(Succ(new_primPlusNat1(wu210, wu2200)), wu230)
new_primPlusNat0(Zero, Zero, wu230) → new_primPlusNat3(wu230)
new_fromEnum9(wu6) → error([])
new_fromEnum3(wu6) → error([])
new_fromEnum8(wu6) → error([])
new_fromEnum2(@0) → Pos(Zero)
new_fromEnum0(wu6) → error([])
new_fromEnum1(wu6) → error([])
new_fromEnum(wu6, bd) → error([])
new_fromEnum4(wu6) → error([])
new_fromEnum7(wu6) → error([])
new_fromEnum5(wu15, ty_Bool) → new_fromEnum3(wu15)
new_fromEnum5(wu15, ty_Int) → new_fromEnum8(wu15)
new_fromEnum5(wu15, ty_Float) → new_fromEnum0(wu15)
new_fromEnum5(wu15, ty_Ordering) → new_fromEnum9(wu15)
new_fromEnum5(wu15, ty_Double) → new_fromEnum4(wu15)
new_fromEnum5(wu15, ty_Integer) → new_fromEnum1(wu15)
new_fromEnum5(wu15, ty_@0) → new_fromEnum2(wu15)
new_fromEnum5(wu15, ty_Char) → new_fromEnum7(wu15)
new_fromEnum5(wu15, app(ty_Ratio, bf)) → new_fromEnum(wu15, bf)
new_primPlusInt0(Zero, Neg(Zero), Neg(wu230)) → new_primMinusNat1(wu230)
new_primPlusInt0(Succ(wu210), Neg(Succ(wu2200)), Neg(wu230)) → new_primMinusNat0(Succ(new_primPlusNat1(wu210, wu2200)), wu230)
new_primPlusInt0(Zero, Neg(Succ(wu2200)), Neg(wu230)) → new_primMinusNat0(wu2200, wu230)
new_primPlusInt0(Succ(wu210), Neg(Zero), Neg(wu230)) → new_primMinusNat0(wu210, wu230)
new_primPlusInt0(wu21, Neg(wu220), Pos(wu230)) → Pos(new_primPlusNat0(wu21, wu220, wu230))
new_primPlusInt0(wu21, Pos(wu220), wu23) → new_primPlusInt1(wu21, wu220, wu23)
The set Q consists of the following terms:
new_fromEnum6(x0, ty_Ordering)
new_fromEnum8(x0)
new_primMinusNat2(Succ(x0), x1)
new_fromEnum7(x0)
new_primPlusInt0(Succ(x0), Neg(Succ(x1)), Neg(x2))
new_primPlusInt2(Succ(x0), Pos(Zero), Pos(Zero))
new_fromEnum5(x0, ty_Double)
new_primPlusInt1(Succ(x0), Succ(x1), x2)
new_fromEnum5(x0, ty_Ordering)
new_primPlusNat3(Succ(x0))
new_fromEnum6(x0, ty_@0)
new_ps(x0, x1, x2, x3, x4)
new_fromEnum10(x0, ty_Char)
new_fromEnum9(x0)
new_primPlusInt0(Zero, Neg(Succ(x0)), Neg(x1))
new_primPlusInt0(Zero, Neg(Zero), Neg(x0))
new_fromEnum5(x0, ty_Int)
new_primPlusNat1(Zero, Succ(x0))
new_fromEnum10(x0, ty_@0)
new_primPlusNat1(Succ(x0), Succ(x1))
new_primPlusNat2(x0, Zero)
new_primPlusInt1(Succ(x0), Zero, Neg(x1))
new_fromEnum(x0, x1)
new_fromEnum10(x0, ty_Integer)
new_primPlusInt2(Zero, Pos(Succ(x0)), Pos(Zero))
new_primPlusInt1(Zero, Zero, Neg(x0))
new_primPlusNat1(Succ(x0), Zero)
new_primPlusInt2(x0, Neg(x1), x2)
new_primPlusInt0(x0, Pos(x1), x2)
new_fromEnum3(x0)
new_fromEnum6(x0, app(ty_Ratio, x1))
new_primPlusInt2(Succ(x0), Pos(Zero), Pos(Succ(x1)))
new_fromEnum5(x0, ty_@0)
new_primPlusNat0(Succ(x0), Succ(x1), x2)
new_primPlusInt0(Succ(x0), Neg(Zero), Neg(x1))
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Zero, Zero)
new_primPlusNat0(Zero, Zero, x0)
new_fromEnum4(x0)
new_fromEnum6(x0, ty_Bool)
new_fromEnum6(x0, ty_Float)
new_primPlusInt2(Succ(x0), Pos(Succ(x1)), Pos(Zero))
new_fromEnum10(x0, ty_Double)
new_primPlusInt1(Zero, Succ(x0), Neg(x1))
new_primMinusNat3(Zero, Zero)
new_fromEnum5(x0, ty_Integer)
new_fromEnum6(x0, ty_Integer)
new_primPlusInt2(Zero, Pos(Zero), Pos(Succ(x0)))
new_fromEnum1(x0)
new_primPlusInt1(Zero, Zero, Pos(x0))
new_fromEnum10(x0, ty_Int)
new_fromEnum5(x0, ty_Char)
new_primPlusInt2(Succ(x0), Pos(Succ(x1)), Pos(Succ(x2)))
new_fromEnum6(x0, ty_Double)
new_primMinusNat3(Zero, Succ(x0))
new_primMinusNat1(Zero)
new_primPlusInt0(x0, Neg(x1), Pos(x2))
new_primMinusNat3(Succ(x0), Succ(x1))
new_fromEnum5(x0, app(ty_Ratio, x1))
new_fromEnum2(@0)
new_primPlusInt2(x0, Pos(x1), Neg(x2))
new_fromEnum10(x0, ty_Float)
new_fromEnum0(x0)
new_primMinusNat0(x0, Zero)
new_primPlusNat3(Zero)
new_primMinusNat2(Zero, x0)
new_primPlusNat0(Zero, Succ(x0), x1)
new_fromEnum5(x0, ty_Float)
new_fromEnum10(x0, ty_Ordering)
new_primPlusInt1(Succ(x0), Zero, Pos(x1))
new_primPlusInt1(Zero, Succ(x0), Pos(x1))
new_primMinusNat3(Succ(x0), Zero)
new_primPlusNat2(x0, Succ(x1))
new_primPlusInt2(Zero, Pos(Zero), Pos(Zero))
new_fromEnum10(x0, app(ty_Ratio, x1))
new_primPlusInt3(Pos(x0), x1, x2, x3)
new_fromEnum6(x0, ty_Char)
new_primPlusInt2(Zero, Pos(Succ(x0)), Pos(Succ(x1)))
new_primPlusNat0(Succ(x0), Zero, x1)
new_primMinusNat0(x0, Succ(x1))
new_primPlusInt3(Neg(x0), x1, x2, x3)
new_fromEnum6(x0, ty_Int)
new_fromEnum5(x0, ty_Bool)
new_fromEnum10(x0, ty_Bool)
We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.
new_ps(x0, x1, x2, x3, x4)
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ MNOCProof
↳ Narrow
Q DP problem:
The TRS P consists of the following rules:
new_map(wu6, wu7, wu8, ba, bb, bc) → new_map(wu6, wu7, new_primPlusInt3(new_fromEnum10(wu6, bb), wu7, wu8, bc), ba, bb, bc)
The TRS R consists of the following rules:
new_fromEnum10(wu6, ty_Float) → new_fromEnum0(wu6)
new_fromEnum10(wu6, ty_Int) → new_fromEnum8(wu6)
new_fromEnum10(wu6, ty_Double) → new_fromEnum4(wu6)
new_fromEnum10(wu6, ty_Integer) → new_fromEnum1(wu6)
new_fromEnum10(wu6, ty_@0) → new_fromEnum2(wu6)
new_fromEnum10(wu6, ty_Bool) → new_fromEnum3(wu6)
new_fromEnum10(wu6, ty_Ordering) → new_fromEnum9(wu6)
new_fromEnum10(wu6, app(ty_Ratio, bd)) → new_fromEnum(wu6, bd)
new_fromEnum10(wu6, ty_Char) → new_fromEnum7(wu6)
new_primPlusInt3(Pos(wu140), wu15, wu16, be) → new_primPlusInt0(wu140, new_fromEnum5(wu15, be), wu16)
new_primPlusInt3(Neg(wu140), wu15, wu16, be) → new_primPlusInt2(wu140, new_fromEnum6(wu15, be), wu16)
new_fromEnum6(wu15, ty_Char) → new_fromEnum7(wu15)
new_fromEnum6(wu15, ty_Double) → new_fromEnum4(wu15)
new_fromEnum6(wu15, app(ty_Ratio, bf)) → new_fromEnum(wu15, bf)
new_fromEnum6(wu15, ty_Integer) → new_fromEnum1(wu15)
new_fromEnum6(wu15, ty_Float) → new_fromEnum0(wu15)
new_fromEnum6(wu15, ty_@0) → new_fromEnum2(wu15)
new_fromEnum6(wu15, ty_Int) → new_fromEnum8(wu15)
new_fromEnum6(wu15, ty_Bool) → new_fromEnum3(wu15)
new_fromEnum6(wu15, ty_Ordering) → new_fromEnum9(wu15)
new_primPlusInt2(Succ(wu280), Pos(Zero), Pos(Zero)) → new_primMinusNat2(Zero, wu280)
new_primPlusInt2(Succ(wu280), Pos(Zero), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), wu280)
new_primPlusInt2(Zero, Pos(Succ(wu2900)), Pos(Zero)) → new_primMinusNat2(Zero, wu2900)
new_primPlusInt2(Zero, Pos(Zero), Pos(Succ(wu3000))) → new_primMinusNat0(wu3000, Zero)
new_primPlusInt2(wu28, Pos(wu290), Neg(wu300)) → Neg(new_primPlusNat0(wu28, wu290, wu300))
new_primPlusInt2(Succ(wu280), Pos(Succ(wu2900)), Pos(Zero)) → new_primMinusNat2(Zero, Succ(new_primPlusNat1(wu280, wu2900)))
new_primPlusInt2(Zero, Pos(Succ(wu2900)), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), wu2900)
new_primPlusInt2(wu28, Neg(wu290), wu30) → new_primPlusInt1(wu290, wu28, wu30)
new_primPlusInt2(Zero, Pos(Zero), Pos(Zero)) → new_primMinusNat1(Zero)
new_primPlusInt2(Succ(wu280), Pos(Succ(wu2900)), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), Succ(new_primPlusNat1(wu280, wu2900)))
new_primPlusNat1(Succ(wu2100), Succ(wu22000)) → Succ(Succ(new_primPlusNat1(wu2100, wu22000)))
new_primPlusNat1(Zero, Zero) → Zero
new_primPlusNat1(Succ(wu2100), Zero) → Succ(wu2100)
new_primPlusNat1(Zero, Succ(wu22000)) → Succ(wu22000)
new_primMinusNat2(Succ(wu2300), wu2200) → new_primMinusNat3(wu2300, wu2200)
new_primMinusNat3(Zero, Succ(wu23000)) → Neg(Succ(wu23000))
new_primMinusNat3(Succ(wu2100), Zero) → Pos(Succ(wu2100))
new_primMinusNat3(Zero, Zero) → Pos(Zero)
new_primMinusNat3(Succ(wu2100), Succ(wu23000)) → new_primMinusNat3(wu2100, wu23000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt1(Succ(wu210), Zero, Pos(wu230)) → Pos(new_primPlusNat2(wu210, wu230))
new_primPlusInt1(Zero, Zero, Pos(wu230)) → Pos(new_primPlusNat3(wu230))
new_primPlusInt1(Zero, Zero, Neg(wu230)) → new_primMinusNat1(wu230)
new_primPlusInt1(Succ(wu210), Zero, Neg(wu230)) → new_primMinusNat0(wu210, wu230)
new_primPlusInt1(Zero, Succ(wu2200), Pos(wu230)) → new_primMinusNat2(wu230, wu2200)
new_primPlusInt1(Zero, Succ(wu2200), Neg(wu230)) → Neg(new_primPlusNat2(wu2200, wu230))
new_primPlusInt1(Succ(wu210), Succ(wu2200), wu23) → new_primPlusInt1(wu210, wu2200, wu23)
new_primPlusNat2(wu210, Succ(wu2300)) → Succ(Succ(new_primPlusNat1(wu210, wu2300)))
new_primPlusNat2(wu210, Zero) → Succ(wu210)
new_primMinusNat2(Zero, wu2200) → Neg(Succ(wu2200))
new_primMinusNat0(wu210, Zero) → Pos(Succ(wu210))
new_primMinusNat0(wu210, Succ(wu2300)) → new_primMinusNat3(wu210, wu2300)
new_primMinusNat1(Succ(wu2300)) → Neg(Succ(wu2300))
new_primPlusNat3(Zero) → Zero
new_primPlusNat3(Succ(wu2300)) → Succ(wu2300)
new_primPlusNat0(Succ(wu210), Zero, wu230) → new_primPlusNat2(wu210, wu230)
new_primPlusNat0(Zero, Succ(wu2200), wu230) → new_primPlusNat2(wu2200, wu230)
new_primPlusNat0(Succ(wu210), Succ(wu2200), wu230) → new_primPlusNat2(Succ(new_primPlusNat1(wu210, wu2200)), wu230)
new_primPlusNat0(Zero, Zero, wu230) → new_primPlusNat3(wu230)
new_fromEnum9(wu6) → error([])
new_fromEnum3(wu6) → error([])
new_fromEnum8(wu6) → error([])
new_fromEnum2(@0) → Pos(Zero)
new_fromEnum0(wu6) → error([])
new_fromEnum1(wu6) → error([])
new_fromEnum(wu6, bd) → error([])
new_fromEnum4(wu6) → error([])
new_fromEnum7(wu6) → error([])
new_fromEnum5(wu15, ty_Bool) → new_fromEnum3(wu15)
new_fromEnum5(wu15, ty_Int) → new_fromEnum8(wu15)
new_fromEnum5(wu15, ty_Float) → new_fromEnum0(wu15)
new_fromEnum5(wu15, ty_Ordering) → new_fromEnum9(wu15)
new_fromEnum5(wu15, ty_Double) → new_fromEnum4(wu15)
new_fromEnum5(wu15, ty_Integer) → new_fromEnum1(wu15)
new_fromEnum5(wu15, ty_@0) → new_fromEnum2(wu15)
new_fromEnum5(wu15, ty_Char) → new_fromEnum7(wu15)
new_fromEnum5(wu15, app(ty_Ratio, bf)) → new_fromEnum(wu15, bf)
new_primPlusInt0(Zero, Neg(Zero), Neg(wu230)) → new_primMinusNat1(wu230)
new_primPlusInt0(Succ(wu210), Neg(Succ(wu2200)), Neg(wu230)) → new_primMinusNat0(Succ(new_primPlusNat1(wu210, wu2200)), wu230)
new_primPlusInt0(Zero, Neg(Succ(wu2200)), Neg(wu230)) → new_primMinusNat0(wu2200, wu230)
new_primPlusInt0(Succ(wu210), Neg(Zero), Neg(wu230)) → new_primMinusNat0(wu210, wu230)
new_primPlusInt0(wu21, Neg(wu220), Pos(wu230)) → Pos(new_primPlusNat0(wu21, wu220, wu230))
new_primPlusInt0(wu21, Pos(wu220), wu23) → new_primPlusInt1(wu21, wu220, wu23)
The set Q consists of the following terms:
new_fromEnum6(x0, ty_Ordering)
new_fromEnum8(x0)
new_primMinusNat2(Succ(x0), x1)
new_fromEnum7(x0)
new_primPlusInt0(Succ(x0), Neg(Succ(x1)), Neg(x2))
new_primPlusInt2(Succ(x0), Pos(Zero), Pos(Zero))
new_fromEnum5(x0, ty_Double)
new_primPlusInt1(Succ(x0), Succ(x1), x2)
new_fromEnum5(x0, ty_Ordering)
new_primPlusNat3(Succ(x0))
new_fromEnum6(x0, ty_@0)
new_fromEnum10(x0, ty_Char)
new_fromEnum9(x0)
new_primPlusInt0(Zero, Neg(Succ(x0)), Neg(x1))
new_primPlusInt0(Zero, Neg(Zero), Neg(x0))
new_fromEnum5(x0, ty_Int)
new_primPlusNat1(Zero, Succ(x0))
new_fromEnum10(x0, ty_@0)
new_primPlusNat1(Succ(x0), Succ(x1))
new_primPlusNat2(x0, Zero)
new_primPlusInt1(Succ(x0), Zero, Neg(x1))
new_fromEnum(x0, x1)
new_fromEnum10(x0, ty_Integer)
new_primPlusInt2(Zero, Pos(Succ(x0)), Pos(Zero))
new_primPlusInt1(Zero, Zero, Neg(x0))
new_primPlusNat1(Succ(x0), Zero)
new_primPlusInt2(x0, Neg(x1), x2)
new_primPlusInt0(x0, Pos(x1), x2)
new_fromEnum3(x0)
new_fromEnum6(x0, app(ty_Ratio, x1))
new_primPlusInt2(Succ(x0), Pos(Zero), Pos(Succ(x1)))
new_fromEnum5(x0, ty_@0)
new_primPlusNat0(Succ(x0), Succ(x1), x2)
new_primPlusInt0(Succ(x0), Neg(Zero), Neg(x1))
new_primMinusNat1(Succ(x0))
new_primPlusNat1(Zero, Zero)
new_primPlusNat0(Zero, Zero, x0)
new_fromEnum4(x0)
new_fromEnum6(x0, ty_Bool)
new_fromEnum6(x0, ty_Float)
new_primPlusInt2(Succ(x0), Pos(Succ(x1)), Pos(Zero))
new_fromEnum10(x0, ty_Double)
new_primPlusInt1(Zero, Succ(x0), Neg(x1))
new_primMinusNat3(Zero, Zero)
new_fromEnum5(x0, ty_Integer)
new_fromEnum6(x0, ty_Integer)
new_primPlusInt2(Zero, Pos(Zero), Pos(Succ(x0)))
new_fromEnum1(x0)
new_primPlusInt1(Zero, Zero, Pos(x0))
new_fromEnum10(x0, ty_Int)
new_fromEnum5(x0, ty_Char)
new_primPlusInt2(Succ(x0), Pos(Succ(x1)), Pos(Succ(x2)))
new_fromEnum6(x0, ty_Double)
new_primMinusNat3(Zero, Succ(x0))
new_primMinusNat1(Zero)
new_primPlusInt0(x0, Neg(x1), Pos(x2))
new_primMinusNat3(Succ(x0), Succ(x1))
new_fromEnum5(x0, app(ty_Ratio, x1))
new_fromEnum2(@0)
new_primPlusInt2(x0, Pos(x1), Neg(x2))
new_fromEnum10(x0, ty_Float)
new_fromEnum0(x0)
new_primMinusNat0(x0, Zero)
new_primPlusNat3(Zero)
new_primMinusNat2(Zero, x0)
new_primPlusNat0(Zero, Succ(x0), x1)
new_fromEnum5(x0, ty_Float)
new_fromEnum10(x0, ty_Ordering)
new_primPlusInt1(Succ(x0), Zero, Pos(x1))
new_primPlusInt1(Zero, Succ(x0), Pos(x1))
new_primMinusNat3(Succ(x0), Zero)
new_primPlusNat2(x0, Succ(x1))
new_primPlusInt2(Zero, Pos(Zero), Pos(Zero))
new_fromEnum10(x0, app(ty_Ratio, x1))
new_primPlusInt3(Pos(x0), x1, x2, x3)
new_fromEnum6(x0, ty_Char)
new_primPlusInt2(Zero, Pos(Succ(x0)), Pos(Succ(x1)))
new_primPlusNat0(Succ(x0), Zero, x1)
new_primMinusNat0(x0, Succ(x1))
new_primPlusInt3(Neg(x0), x1, x2, x3)
new_fromEnum6(x0, ty_Int)
new_fromEnum5(x0, ty_Bool)
new_fromEnum10(x0, ty_Bool)
We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ Rewriting
↳ QDP
↳ UsableRulesProof
↳ QDP
↳ QReductionProof
↳ QDP
↳ MNOCProof
↳ QDP
↳ NonTerminationProof
↳ Narrow
Q DP problem:
The TRS P consists of the following rules:
new_map(wu6, wu7, wu8, ba, bb, bc) → new_map(wu6, wu7, new_primPlusInt3(new_fromEnum10(wu6, bb), wu7, wu8, bc), ba, bb, bc)
The TRS R consists of the following rules:
new_fromEnum10(wu6, ty_Float) → new_fromEnum0(wu6)
new_fromEnum10(wu6, ty_Int) → new_fromEnum8(wu6)
new_fromEnum10(wu6, ty_Double) → new_fromEnum4(wu6)
new_fromEnum10(wu6, ty_Integer) → new_fromEnum1(wu6)
new_fromEnum10(wu6, ty_@0) → new_fromEnum2(wu6)
new_fromEnum10(wu6, ty_Bool) → new_fromEnum3(wu6)
new_fromEnum10(wu6, ty_Ordering) → new_fromEnum9(wu6)
new_fromEnum10(wu6, app(ty_Ratio, bd)) → new_fromEnum(wu6, bd)
new_fromEnum10(wu6, ty_Char) → new_fromEnum7(wu6)
new_primPlusInt3(Pos(wu140), wu15, wu16, be) → new_primPlusInt0(wu140, new_fromEnum5(wu15, be), wu16)
new_primPlusInt3(Neg(wu140), wu15, wu16, be) → new_primPlusInt2(wu140, new_fromEnum6(wu15, be), wu16)
new_fromEnum6(wu15, ty_Char) → new_fromEnum7(wu15)
new_fromEnum6(wu15, ty_Double) → new_fromEnum4(wu15)
new_fromEnum6(wu15, app(ty_Ratio, bf)) → new_fromEnum(wu15, bf)
new_fromEnum6(wu15, ty_Integer) → new_fromEnum1(wu15)
new_fromEnum6(wu15, ty_Float) → new_fromEnum0(wu15)
new_fromEnum6(wu15, ty_@0) → new_fromEnum2(wu15)
new_fromEnum6(wu15, ty_Int) → new_fromEnum8(wu15)
new_fromEnum6(wu15, ty_Bool) → new_fromEnum3(wu15)
new_fromEnum6(wu15, ty_Ordering) → new_fromEnum9(wu15)
new_primPlusInt2(Succ(wu280), Pos(Zero), Pos(Zero)) → new_primMinusNat2(Zero, wu280)
new_primPlusInt2(Succ(wu280), Pos(Zero), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), wu280)
new_primPlusInt2(Zero, Pos(Succ(wu2900)), Pos(Zero)) → new_primMinusNat2(Zero, wu2900)
new_primPlusInt2(Zero, Pos(Zero), Pos(Succ(wu3000))) → new_primMinusNat0(wu3000, Zero)
new_primPlusInt2(wu28, Pos(wu290), Neg(wu300)) → Neg(new_primPlusNat0(wu28, wu290, wu300))
new_primPlusInt2(Succ(wu280), Pos(Succ(wu2900)), Pos(Zero)) → new_primMinusNat2(Zero, Succ(new_primPlusNat1(wu280, wu2900)))
new_primPlusInt2(Zero, Pos(Succ(wu2900)), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), wu2900)
new_primPlusInt2(wu28, Neg(wu290), wu30) → new_primPlusInt1(wu290, wu28, wu30)
new_primPlusInt2(Zero, Pos(Zero), Pos(Zero)) → new_primMinusNat1(Zero)
new_primPlusInt2(Succ(wu280), Pos(Succ(wu2900)), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), Succ(new_primPlusNat1(wu280, wu2900)))
new_primPlusNat1(Succ(wu2100), Succ(wu22000)) → Succ(Succ(new_primPlusNat1(wu2100, wu22000)))
new_primPlusNat1(Zero, Zero) → Zero
new_primPlusNat1(Succ(wu2100), Zero) → Succ(wu2100)
new_primPlusNat1(Zero, Succ(wu22000)) → Succ(wu22000)
new_primMinusNat2(Succ(wu2300), wu2200) → new_primMinusNat3(wu2300, wu2200)
new_primMinusNat3(Zero, Succ(wu23000)) → Neg(Succ(wu23000))
new_primMinusNat3(Succ(wu2100), Zero) → Pos(Succ(wu2100))
new_primMinusNat3(Zero, Zero) → Pos(Zero)
new_primMinusNat3(Succ(wu2100), Succ(wu23000)) → new_primMinusNat3(wu2100, wu23000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt1(Succ(wu210), Zero, Pos(wu230)) → Pos(new_primPlusNat2(wu210, wu230))
new_primPlusInt1(Zero, Zero, Pos(wu230)) → Pos(new_primPlusNat3(wu230))
new_primPlusInt1(Zero, Zero, Neg(wu230)) → new_primMinusNat1(wu230)
new_primPlusInt1(Succ(wu210), Zero, Neg(wu230)) → new_primMinusNat0(wu210, wu230)
new_primPlusInt1(Zero, Succ(wu2200), Pos(wu230)) → new_primMinusNat2(wu230, wu2200)
new_primPlusInt1(Zero, Succ(wu2200), Neg(wu230)) → Neg(new_primPlusNat2(wu2200, wu230))
new_primPlusInt1(Succ(wu210), Succ(wu2200), wu23) → new_primPlusInt1(wu210, wu2200, wu23)
new_primPlusNat2(wu210, Succ(wu2300)) → Succ(Succ(new_primPlusNat1(wu210, wu2300)))
new_primPlusNat2(wu210, Zero) → Succ(wu210)
new_primMinusNat2(Zero, wu2200) → Neg(Succ(wu2200))
new_primMinusNat0(wu210, Zero) → Pos(Succ(wu210))
new_primMinusNat0(wu210, Succ(wu2300)) → new_primMinusNat3(wu210, wu2300)
new_primMinusNat1(Succ(wu2300)) → Neg(Succ(wu2300))
new_primPlusNat3(Zero) → Zero
new_primPlusNat3(Succ(wu2300)) → Succ(wu2300)
new_primPlusNat0(Succ(wu210), Zero, wu230) → new_primPlusNat2(wu210, wu230)
new_primPlusNat0(Zero, Succ(wu2200), wu230) → new_primPlusNat2(wu2200, wu230)
new_primPlusNat0(Succ(wu210), Succ(wu2200), wu230) → new_primPlusNat2(Succ(new_primPlusNat1(wu210, wu2200)), wu230)
new_primPlusNat0(Zero, Zero, wu230) → new_primPlusNat3(wu230)
new_fromEnum9(wu6) → error([])
new_fromEnum3(wu6) → error([])
new_fromEnum8(wu6) → error([])
new_fromEnum2(@0) → Pos(Zero)
new_fromEnum0(wu6) → error([])
new_fromEnum1(wu6) → error([])
new_fromEnum(wu6, bd) → error([])
new_fromEnum4(wu6) → error([])
new_fromEnum7(wu6) → error([])
new_fromEnum5(wu15, ty_Bool) → new_fromEnum3(wu15)
new_fromEnum5(wu15, ty_Int) → new_fromEnum8(wu15)
new_fromEnum5(wu15, ty_Float) → new_fromEnum0(wu15)
new_fromEnum5(wu15, ty_Ordering) → new_fromEnum9(wu15)
new_fromEnum5(wu15, ty_Double) → new_fromEnum4(wu15)
new_fromEnum5(wu15, ty_Integer) → new_fromEnum1(wu15)
new_fromEnum5(wu15, ty_@0) → new_fromEnum2(wu15)
new_fromEnum5(wu15, ty_Char) → new_fromEnum7(wu15)
new_fromEnum5(wu15, app(ty_Ratio, bf)) → new_fromEnum(wu15, bf)
new_primPlusInt0(Zero, Neg(Zero), Neg(wu230)) → new_primMinusNat1(wu230)
new_primPlusInt0(Succ(wu210), Neg(Succ(wu2200)), Neg(wu230)) → new_primMinusNat0(Succ(new_primPlusNat1(wu210, wu2200)), wu230)
new_primPlusInt0(Zero, Neg(Succ(wu2200)), Neg(wu230)) → new_primMinusNat0(wu2200, wu230)
new_primPlusInt0(Succ(wu210), Neg(Zero), Neg(wu230)) → new_primMinusNat0(wu210, wu230)
new_primPlusInt0(wu21, Neg(wu220), Pos(wu230)) → Pos(new_primPlusNat0(wu21, wu220, wu230))
new_primPlusInt0(wu21, Pos(wu220), wu23) → new_primPlusInt1(wu21, wu220, wu23)
Q is empty.
We have to consider all (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.
The TRS P consists of the following rules:
new_map(wu6, wu7, wu8, ba, bb, bc) → new_map(wu6, wu7, new_primPlusInt3(new_fromEnum10(wu6, bb), wu7, wu8, bc), ba, bb, bc)
The TRS R consists of the following rules:
new_fromEnum10(wu6, ty_Float) → new_fromEnum0(wu6)
new_fromEnum10(wu6, ty_Int) → new_fromEnum8(wu6)
new_fromEnum10(wu6, ty_Double) → new_fromEnum4(wu6)
new_fromEnum10(wu6, ty_Integer) → new_fromEnum1(wu6)
new_fromEnum10(wu6, ty_@0) → new_fromEnum2(wu6)
new_fromEnum10(wu6, ty_Bool) → new_fromEnum3(wu6)
new_fromEnum10(wu6, ty_Ordering) → new_fromEnum9(wu6)
new_fromEnum10(wu6, app(ty_Ratio, bd)) → new_fromEnum(wu6, bd)
new_fromEnum10(wu6, ty_Char) → new_fromEnum7(wu6)
new_primPlusInt3(Pos(wu140), wu15, wu16, be) → new_primPlusInt0(wu140, new_fromEnum5(wu15, be), wu16)
new_primPlusInt3(Neg(wu140), wu15, wu16, be) → new_primPlusInt2(wu140, new_fromEnum6(wu15, be), wu16)
new_fromEnum6(wu15, ty_Char) → new_fromEnum7(wu15)
new_fromEnum6(wu15, ty_Double) → new_fromEnum4(wu15)
new_fromEnum6(wu15, app(ty_Ratio, bf)) → new_fromEnum(wu15, bf)
new_fromEnum6(wu15, ty_Integer) → new_fromEnum1(wu15)
new_fromEnum6(wu15, ty_Float) → new_fromEnum0(wu15)
new_fromEnum6(wu15, ty_@0) → new_fromEnum2(wu15)
new_fromEnum6(wu15, ty_Int) → new_fromEnum8(wu15)
new_fromEnum6(wu15, ty_Bool) → new_fromEnum3(wu15)
new_fromEnum6(wu15, ty_Ordering) → new_fromEnum9(wu15)
new_primPlusInt2(Succ(wu280), Pos(Zero), Pos(Zero)) → new_primMinusNat2(Zero, wu280)
new_primPlusInt2(Succ(wu280), Pos(Zero), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), wu280)
new_primPlusInt2(Zero, Pos(Succ(wu2900)), Pos(Zero)) → new_primMinusNat2(Zero, wu2900)
new_primPlusInt2(Zero, Pos(Zero), Pos(Succ(wu3000))) → new_primMinusNat0(wu3000, Zero)
new_primPlusInt2(wu28, Pos(wu290), Neg(wu300)) → Neg(new_primPlusNat0(wu28, wu290, wu300))
new_primPlusInt2(Succ(wu280), Pos(Succ(wu2900)), Pos(Zero)) → new_primMinusNat2(Zero, Succ(new_primPlusNat1(wu280, wu2900)))
new_primPlusInt2(Zero, Pos(Succ(wu2900)), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), wu2900)
new_primPlusInt2(wu28, Neg(wu290), wu30) → new_primPlusInt1(wu290, wu28, wu30)
new_primPlusInt2(Zero, Pos(Zero), Pos(Zero)) → new_primMinusNat1(Zero)
new_primPlusInt2(Succ(wu280), Pos(Succ(wu2900)), Pos(Succ(wu3000))) → new_primMinusNat2(Succ(wu3000), Succ(new_primPlusNat1(wu280, wu2900)))
new_primPlusNat1(Succ(wu2100), Succ(wu22000)) → Succ(Succ(new_primPlusNat1(wu2100, wu22000)))
new_primPlusNat1(Zero, Zero) → Zero
new_primPlusNat1(Succ(wu2100), Zero) → Succ(wu2100)
new_primPlusNat1(Zero, Succ(wu22000)) → Succ(wu22000)
new_primMinusNat2(Succ(wu2300), wu2200) → new_primMinusNat3(wu2300, wu2200)
new_primMinusNat3(Zero, Succ(wu23000)) → Neg(Succ(wu23000))
new_primMinusNat3(Succ(wu2100), Zero) → Pos(Succ(wu2100))
new_primMinusNat3(Zero, Zero) → Pos(Zero)
new_primMinusNat3(Succ(wu2100), Succ(wu23000)) → new_primMinusNat3(wu2100, wu23000)
new_primMinusNat1(Zero) → Pos(Zero)
new_primPlusInt1(Succ(wu210), Zero, Pos(wu230)) → Pos(new_primPlusNat2(wu210, wu230))
new_primPlusInt1(Zero, Zero, Pos(wu230)) → Pos(new_primPlusNat3(wu230))
new_primPlusInt1(Zero, Zero, Neg(wu230)) → new_primMinusNat1(wu230)
new_primPlusInt1(Succ(wu210), Zero, Neg(wu230)) → new_primMinusNat0(wu210, wu230)
new_primPlusInt1(Zero, Succ(wu2200), Pos(wu230)) → new_primMinusNat2(wu230, wu2200)
new_primPlusInt1(Zero, Succ(wu2200), Neg(wu230)) → Neg(new_primPlusNat2(wu2200, wu230))
new_primPlusInt1(Succ(wu210), Succ(wu2200), wu23) → new_primPlusInt1(wu210, wu2200, wu23)
new_primPlusNat2(wu210, Succ(wu2300)) → Succ(Succ(new_primPlusNat1(wu210, wu2300)))
new_primPlusNat2(wu210, Zero) → Succ(wu210)
new_primMinusNat2(Zero, wu2200) → Neg(Succ(wu2200))
new_primMinusNat0(wu210, Zero) → Pos(Succ(wu210))
new_primMinusNat0(wu210, Succ(wu2300)) → new_primMinusNat3(wu210, wu2300)
new_primMinusNat1(Succ(wu2300)) → Neg(Succ(wu2300))
new_primPlusNat3(Zero) → Zero
new_primPlusNat3(Succ(wu2300)) → Succ(wu2300)
new_primPlusNat0(Succ(wu210), Zero, wu230) → new_primPlusNat2(wu210, wu230)
new_primPlusNat0(Zero, Succ(wu2200), wu230) → new_primPlusNat2(wu2200, wu230)
new_primPlusNat0(Succ(wu210), Succ(wu2200), wu230) → new_primPlusNat2(Succ(new_primPlusNat1(wu210, wu2200)), wu230)
new_primPlusNat0(Zero, Zero, wu230) → new_primPlusNat3(wu230)
new_fromEnum9(wu6) → error([])
new_fromEnum3(wu6) → error([])
new_fromEnum8(wu6) → error([])
new_fromEnum2(@0) → Pos(Zero)
new_fromEnum0(wu6) → error([])
new_fromEnum1(wu6) → error([])
new_fromEnum(wu6, bd) → error([])
new_fromEnum4(wu6) → error([])
new_fromEnum7(wu6) → error([])
new_fromEnum5(wu15, ty_Bool) → new_fromEnum3(wu15)
new_fromEnum5(wu15, ty_Int) → new_fromEnum8(wu15)
new_fromEnum5(wu15, ty_Float) → new_fromEnum0(wu15)
new_fromEnum5(wu15, ty_Ordering) → new_fromEnum9(wu15)
new_fromEnum5(wu15, ty_Double) → new_fromEnum4(wu15)
new_fromEnum5(wu15, ty_Integer) → new_fromEnum1(wu15)
new_fromEnum5(wu15, ty_@0) → new_fromEnum2(wu15)
new_fromEnum5(wu15, ty_Char) → new_fromEnum7(wu15)
new_fromEnum5(wu15, app(ty_Ratio, bf)) → new_fromEnum(wu15, bf)
new_primPlusInt0(Zero, Neg(Zero), Neg(wu230)) → new_primMinusNat1(wu230)
new_primPlusInt0(Succ(wu210), Neg(Succ(wu2200)), Neg(wu230)) → new_primMinusNat0(Succ(new_primPlusNat1(wu210, wu2200)), wu230)
new_primPlusInt0(Zero, Neg(Succ(wu2200)), Neg(wu230)) → new_primMinusNat0(wu2200, wu230)
new_primPlusInt0(Succ(wu210), Neg(Zero), Neg(wu230)) → new_primMinusNat0(wu210, wu230)
new_primPlusInt0(wu21, Neg(wu220), Pos(wu230)) → Pos(new_primPlusNat0(wu21, wu220, wu230))
new_primPlusInt0(wu21, Pos(wu220), wu23) → new_primPlusInt1(wu21, wu220, wu23)
s = new_map(wu6, wu7, wu8, ba, bb, bc) evaluates to t =new_map(wu6, wu7, new_primPlusInt3(new_fromEnum10(wu6, bb), wu7, wu8, bc), ba, bb, bc)
Thus s starts an infinite chain as s semiunifies with t with the following substitutions:
- Matcher: [wu8 / new_primPlusInt3(new_fromEnum10(wu6, bb), wu7, wu8, bc)]
- Semiunifier: [ ]
Rewriting sequence
The DP semiunifies directly so there is only one rewrite step from new_map(wu6, wu7, wu8, ba, bb, bc) to new_map(wu6, wu7, new_primPlusInt3(new_fromEnum10(wu6, bb), wu7, wu8, bc), ba, bb, bc).
Haskell To QDPs